jMoped: A Java Bytecode Checker Based on Moped

نویسندگان

  • Dejvuth Suwimonteerabuth
  • Stefan Schwoon
  • Javier Esparza
چکیده

We present a tool for finding errors in Java programs that translates Java bytecodes into symbolic pushdown systems, which are then checked by the Moped tool [1].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A test and verification environment for Java programs

This thesis examines an approach that combines model checking and software testing to improve the reliability of software systems. It employs the Moped model checker [Sch02], which computes reachability analyses on pushdown systems, and jMoped [Suw04], which translates Java programs into said pushdown systems. Both Moped and jMoped have been adapted in this work to compute the coverage of reach...

متن کامل

jMoped: A Test Environment for Java Programs

jMoped supports unit testing of Java programs using model-checking techniques. Given a Java method and a (finite) range of inputs, it performs a reachability analysis to check the program for these inputs. Highlights include: • Symbolic testing: uses a BDD-based model checker for testing a large set of inputs. •Generates coverage information from model-checking results. •Tests for common Java e...

متن کامل

Bytecode Model Checking: An Experimental Analysis

Java bytecode verification is traditionally performed by a polynomial time dataflow algorithm. We investigate an alternative based on reducing bytecode verification to model checking. Despite an exponential worst case time complexity, model checking type-correct bytecode is polynomial in practice when carried out using an explicit state, onthe-fly model checker like Spin. We investigate this th...

متن کامل

Java Bytecode Veriication Using Model Checking ?

We provide an abstract interpretation for Java bytecode in order to build nite state models of bytecode programs. The bytecode constraints for assuring safety are formulated in terms of temporal logic formulae. These formulae are checked against the nite program models by a (standard) model checker. By doing so we see a practical way to perform bytecode veriication on a formal basis. This could...

متن کامل

Java Bytecode Veri cation Using Model Checking?

We provide an abstract interpretation for Java bytecode programs to build nite state models of these programs. We describe the bytecode constraints as CTL formulas which can be checked against the nite models by a (standard) model checker. We see a practical way to perform bytecode veri cation on a formal basis in that it could help to achieve higher security and open the door for further exten...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005